A Product Form Solution for Tree Networks with Divisible Loads
نویسنده
چکیده
A product form solution for the optimal fractions of divisible load to distribute to processors in a multi-level tree network is described. Here optimality involves parallel processing the load in a minimal amount of time. This tractable solution is similar to the product form solution for equilibrium state probabilities arising in Markovian queueing networks. The existence of this product form solution answers a long standing open question for divisible load scheduling.
منابع مشابه
Grid Scheduling Divisible Loads from Multiple Sources via Linear Programming
To date solutions for optimal finish time and job allocation in divisible load theory are largely obtained only for network topologies with a single load originating (root) processor. However in large-scale data intensive problems with geographically distributed resources, load is generated from multiple sources. This paper introduces a new divisible load scheduling strategy for tree networks w...
متن کاملA Strategyproof Mechanism for Scheduling Divisible Loads in Tree Networks
The underlying assumption of Divisible Load Scheduling is that the processors composing the network are obedient, i.e., they do not “cheat” the algorithm. This assumption is unrealistic if the processors are owned by autonomous, self-interested organizations that have no a priori motivation for cooperation and they will manipulate the algorithm if it is beneficial to do so. In this paper we pro...
متن کاملGrid scheduling divisible loads from two sources
To date closed form solutions for optimal finish time and job allocation are largely obtained only for network topologies with a single load originating (root) processor. However in large-scale data intensive problems with geographically distributed resources, load is generated from multiple sources. This paper introduces a new divisible load scheduling strategy for single level tree networks w...
متن کاملOptimal Divisible Load Scheduling and Markov Chain Models
In this short paper we consider the equivalence between various load-scheduling policies and continuous time Markov chains. It provides a basic unification of both divisible load scheduling and Markov chains for the first time in 15 years of research. This unification is suggested by the fact that both divisible load scheduling theory and Markovian queueing theory have common features. I. Backg...
متن کاملOn the Influence of Start-Up Costs in Scheduling Divisible Loads on Bus Networks
ÐOptimal distribution of divisible loads in bus networks is considered in this paper. The problem of minimizing the processing time is investigated by including all the overhead components that could penalize the performance of the system, in addition to the inherent communication and computation delays. These overheads are considered to be constant additive factors to the respective communicat...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Parallel Processing Letters
دوره 21 شماره
صفحات -
تاریخ انتشار 2011